Iterative Strengthening: An Algorithm for Generating Anytime Optimal Plans
نویسنده
چکیده
In order to perform adequately in real-world situations, a planning system must be able to nd the \best" solution while still supporting anytime behavior. We have developed a method for incrementally optimizing plans called iterative strengthening that can be used in many situations where other optimization methods are not appropriate. In particular, iterative strengthening supports optimized planning within an \anytime" environment using multiple simultaneous optimizing parameters, and it can be adapted to support inadmissible heuristics and undecidable domains.
منابع مشابه
An UCT Approach for Anytime Agent-Based Planning
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-based algorithm which gave very good results in computer games, and especially in Computer Go, with heuristic search in order to obtain an anytime planner that provides partial plans before finding a solution plan, and fu...
متن کاملNear-Optimal Plans, Tractability, and Reactivity
Many planning problems have recently been shown to be inherently intractable. For example , nding the shortest plan in the blocks-world domain is NP-hard, and so is planning in even some of the most limited STRIPS-style planning formalisms. We explore the question as to what extent these negative results can be attributed to the insistence on nding plans of minimal length. Using recent results ...
متن کاملOptimal Anytime Constrained Simulated Annealing for Constrained Global Optimization
In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goals of the algorithm is to generate feasible solutions of certain prescribed quality using an average time of the same order of magnitude as that spent by the original CSA with an optimal cooling schedule in generating a solutio...
متن کاملPlanning by Rewriting: Efficiently Generating High-Quality Plans
Domain-independent planning is a hard combinatorial problem. Taking into account plan quality makes the task even more di cult. We introduce a new paradigm for e cient high-quality planning that exploits plan rewriting rules and e cient local search techniques to transform an easy-to-generate, but possibly suboptimal, initial plan into a low-cost plan. In addition to addressing the issues of e ...
متن کاملOn Improving Plan Quality via Local Enhancements
There exist planning algorithms that can quickly find suboptimal plans even for large problems and planning algorithms finding optimal plans but only for smaller problems. We attempt to integrate both approaches. We present an anytime technique for improving plan quality (decreasing the plan makespan) via substituting parts of the plan by better sub-plans. The technique guarantees optimality th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994